An Application of WordNet to Prepositional Attachment

نویسنده

  • Sanda M. Harabagiu
چکیده

This paper presents a method for word sense disambiguation and coherence understanding of prepositional relations. The method relies on information provided by WordNet 1.5. We rst classify preposi-tional attachments according to semantic equivalence of phrase heads and then apply inferential heuristics for understanding the validity of prepositional structures. 1 Problem description In this paper, we address the problem of disam-biguation and understanding prepositional attachment. The arguments of prepositional relations are automatically categorized into semantically equivalent classes of WordNet (Miller and Teibel, 1991) concepts. Then by applying inferential heuristics on each class, we establish semantic connections between arguments that explain the validity of that prepositional structure. The method uses information provided by WordNet, such as semantic relations and textual glosses. We have collected prepositional relations from the Wall Street Journal tagged articles of the PENN TREEBANK. Here, we focus on preposition of, the most frequently used preposition in the corpus. 2 Classes of prepositional relations Since most of the prepositional attachments obey the principle of locality (Wertmer, 1991), we considered only the case of prepositional phrases preceded by noun or verb phrases. We scanned the corpus and ltered the phrase heads to create C, an ad hoc collection of sequences < noun prep noun > and < verb prep noun >. This collection is divided into classes of prepositional relations, using the following deenitions: Deenition 1: Two prepositional structures < noun 1 prep noun 2 > and < noun 3 prep noun 4 > belong to the same class if one of the following conditions holds: noun 1 , and noun 2 are hypernym/hyponym of noun 3 , and noun 4 respectively, or noun 1 , and noun 2 have a common hyper-nym/hyponym and with noun 3 , and noun 4 , respectively. A particular case is when noun 1 (noun 2) and noun 3 (noun 4) are synonyms. Deenition 2: Two prepositional structures < verb 1 prep noun 1 > and < verb 2 prep noun 2 > belong to the same class if one of the following conditions holds: verb 1 , and noun 1 are hypernym/hyponym of verb 2 , and noun 2 , respectively or verb 1 , and noun 1 have a common hyper-nym/hyponym with verb 2 , and noun 2 , respectively. A particular case is when the verbs or the nouns are synonyms, respectively. The main beneet and reason for grouping prepo-sitional relations into …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Prepositional Phrase Attachment Problem Revisited: how Verbnet can Help

Resolving attachment ambiguities is a pervasive problem in syntactic analysis. We propose and investigate an approach to resolving prepositional phrase attachment that centers around the ways of incorporating semantic knowledge derived from the lexico-semantic ontologies such as VERBNET and WORDNET.

متن کامل

Prepositional Phrase Attachment Disambiguation using WordNet

In this thesis we use a knowledge-based approach to disambiguating prepositional phrase attachments in English sentences. This method was first introduced by S. M. Harabagiu. The Penn Treebank corpus is used as the training text. We extract 4-tuples of the form [ V P , NP1, Prep, NP2 ] and sort them into classes according to the semantic relationships between parts of each tuple. These relation...

متن کامل

Prepositional Phrase Attachment Ambiguity Resolution Using Semantic Hierarchies

This paper describes a system that resolves prepositional phrase attachment ambiguity in English sentence processing. This attachment problem is ubiquitous in English text, and is widely known as a place where semantics determines syntactic form. The decision is made based on a four-tuple composed of the head verb of the verb phrase, the head noun of the noun phrase, and the preposition and hea...

متن کامل

Ontology-Aware Token Embeddings for Prepositional Phrase Attachment

Type-level word embeddings use the same set of parameters to represent all instances of a word regardless of its context, ignoring the inherent lexical ambiguity in language. Instead, we embed semantic concepts (or synsets) as defined in WordNet and represent a word token in a particular context by estimating a distribution over relevant semantic concepts. We use the new, context-sensitive embe...

متن کامل

Acquiring Selectional Preferences from Untagged Text for Prepositional Phrase Attachment Disambiguation

Extracting information automatically from texts for database representation requires previously well-grouped phrases so that entities can be separated adequately. This problem is known as prepositional phrase (PP) attachment disambiguation. Current PP attachment disambiguation systems require an annotated treebank or they use an Internet connection to achieve a precision of more than 90%. Unfor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996